Matrix sandwich problems
نویسندگان
چکیده
منابع مشابه
Graph sandwich problems
A sandwich problem for a graph with respect to a graph property Π is a partially specified graph, i.e., only some of the edges and non-edges are given, and the question to be answered is, can this graph be completed to a graph which has the property Π? The graph sandwich problem was investigated for a large number of families of graphs in a 1995 paper by Golumbic, Kaplan and Shamir, and much su...
متن کاملOn Poset Sandwich Problems
A graph Gs = (V,Es) is a sandwich for a pair of graph Gt = (V,Et) and G = (V,E) if Et ⊆ Es ⊆ E. Any poset, or partially ordered set, admits a unique graph representation which is directed and transitive. In this paper we introduce the notion of sandwich poset problems inspired by former sandwich problems on comparability graphs. In particular, we are interested in seriesparallel and interval po...
متن کاملThe Sandwich (robust Covariance Matrix) Estimator
The sandwich estimator, often known as the robust covariance matrix estimator or the empirical covariance matrix estimator, has achieved increasing use with the growing popularity of generalized estimating equations. Its virtue is that it provides consistent estimates of the covariance matrix for parameter estimates even when a parametric model fails to hold, or is not even specified. Surprisin...
متن کاملCan transitive orientation make sandwich problems easier?
A graph G s = (V , E s) is a sandwich for a pair of graphs G t = (V , E t) and G = (V , E) if E t ⊆ E s ⊆ E. A sandwich problem asks for the existence of a sandwich graph having an expected property. In a seminal paper, Golumbic et al. [Graph sandwich problems, J. Algorithms 19 (1995) 449–473] present many results on sub-families of perfect graphs. We are especially interested in comparability ...
متن کاملPhysical Maps and Interval Sandwich Problems: Bounded Degrees Help
The problems of Interval Sandwich (IS) and Intervalizing Colored Graphs (ICG) have received a lot of attention recently, due to their applicability to DNA physical mapping problems with ambiguous data. Most of the results obtained so far on the problems were hardness results. Here we study the problems under assumptions of sparseness, which hold in the biological context. We prove that both pro...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Linear Algebra and its Applications
سال: 1998
ISSN: 0024-3795
DOI: 10.1016/s0024-3795(97)10075-1